On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

Prediction of drug-target interaction by integrating diverse heterogeneous information source with multiple kernel learning and clustering methods

BackgroundIdentification of potential drug-target interaction pairs is very important for pharmaceutical innovation and drug discovery. Numerous machine learning-based and network-based algorithms have been developed for predicting drug-target interactions. However, large-scale pharmacological, genomic and chemical datum emerged recently provide new opportunity for further heightening the accuracy of drug-target interactions prediction.ResultsIn this work, based on the assumption that similar drugs tend to interact with similar proteins and vice versa, we developed a novel computational method (namely MKLC-BiRW) to predict new drug-target interactions. MKLC-BiRW integrates diverse drug-related and target-related heterogeneous information source by using the multiple kernel learning and clustering methods to generate the drug and target similarity matrices, in which the low similarity elements are set to zero to build the drug and target similarity correction networks. By incorporating these drug and target similarity correction networks with known drug-target interaction bipartite graph, MKLC-BiRW constructs the heterogeneous network on which Bi-random walk algorithm is adopted to infer the potential drug-target interactions.ConclusionsCompared with other existing state-of-the-art methods, MKLC-BiRW achieves the best performance in terms of AUC and AUPR. MKLC-BiRW can effectively predict the potential drug-target interactions.     

Existence of solutions for a higher-order semilinear parabolic equation with singular initial data

We establish the existence of solutions of the Cauchy problem for a higher-order semilinear parabolic equation by introducing a new majorizing kernel. We also study necessary conditions on the initial data for the existence of local-in-time solutions and identify the strongest singularity of the initial data for the solvability of the Cauchy problem.     

Hellmann–Feynman connection for the relative Fisher information

The (i) reciprocity relations for the relative Fisher information (RFI, hereafter) and (ii) a generalized RFI–Euler theorem are self-consistently derived from the Hellmann–Feynman theorem. These new reciprocity relations generalize the RFI–Euler theorem and constitute the basis for building up a mathematical Legendre transform structure (LTS, hereafter), akin to that of thermodynamics, that underlies the RFI scenario. This demonstrates the possibility of translating the entire mathematical structure of thermodynamics into a RFI-based theoretical framework. Virial theorems play a prominent role in this endeavor, as a Schrödinger-like equation can be associated to the RFI. Lagrange multipliers are determined invoking the RFI–LTS link and the quantum mechanical virial theorem. An appropriate ansatz allows for the inference of probability density functions (pdf’s, hereafter) and energy-eigenvalues of the above mentioned Schrödinger-like equation. The energy-eigenvalues obtained here via inference are benchmarked against established theoretical and numerical results. A principled theoretical basis to reconstruct the RFI-framework from the FIM framework is established. Numerical examples for exemplary cases are provided.     

Uniform stability of semilinear wave equations with arbitrary local memory effects versus frictional dampings

This paper is concerned with the mixed initial–boundary value problem for semilinear wave equations with complementary frictional dampings and memory effects. We successfully establish uniform exponential and polynomial decay rates for the solutions to this initial–boundary value problem under much weak conditions concerning memory effects. More specifically, we obtain the exponential and polynomial decay rates after removing the fundamental condition that the memory-effect region includes a part of the system boundary, while the condition is a necessity in the previous literature; moreover, for the polynomial decay rates we only assume minimal conditions on the memory kernel function g, without the usual assumption of $g^{\prime }$ controlled by g.     

System bandwidth and the existence of generalized shift-invariant frames

We consider the question whether, given a countable family of lattices ${({\mathrm{\Gamma }}_j)}_{j\in J}$ in a locally compact abelian group G, there exist functions ${(g_j)}_{j\in J}$ such that the resulting generalized shift-invariant system ${(g_j(??\gamma ))}_{j\in J,\gamma \in {\mathrm{\Gamma }}_j}$ is a tight frame of $L^2(G)$. This paper develops a new approach to the study of generalized shift-invariant system via almost periodic functions, based on a novel unconditional convergence property. From this theory, we derive characterizing relations for tight and dual frame generators, we introduce the system bandwidth as a measure of the total bandwidth a generalized shift-invariant system can carry, and we show that the so-called Calderón sum is uniformly bounded from below for generalized shift-invariant frames. Without the unconditional convergence property, we show, counter intuitively, that even orthonormal bases can have arbitrary small system bandwidth. Our results show that the question of existence of frame generators for a general lattice system is rather subtle and depends on analytical and algebraic properties of the lattice system.